Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), a))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), a))
Q is empty.
Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
F(f(a, f(x, a)), a) → F(a, f(f(x, a), a))
F(f(a, f(x, a)), a) → F(f(x, a), a)
The TRS R consists of the following rules:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), a))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ EdgeDeletionProof
Q DP problem:
The TRS P consists of the following rules:
F(f(a, f(x, a)), a) → F(a, f(f(x, a), a))
F(f(a, f(x, a)), a) → F(f(x, a), a)
The TRS R consists of the following rules:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), a))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ EdgeDeletionProof
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
F(f(a, f(x, a)), a) → F(a, f(f(x, a), a))
F(f(a, f(x, a)), a) → F(f(x, a), a)
The TRS R consists of the following rules:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), a))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ EdgeDeletionProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
Q DP problem:
The TRS P consists of the following rules:
F(f(a, f(x, a)), a) → F(f(x, a), a)
The TRS R consists of the following rules:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), a))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].
The following pairs can be oriented strictly and are deleted.
F(f(a, f(x, a)), a) → F(f(x, a), a)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
F(x1, x2) = x1
f(x1, x2) = f(x1, x2)
a = a
Lexicographic path order with status [19].
Quasi-Precedence: trivial
Status: f2: [1,2]
The following usable rules [14] were oriented:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), a))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ EdgeDeletionProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
Q DP problem:
P is empty.
The TRS R consists of the following rules:
f(f(a, f(x, a)), a) → f(a, f(f(x, a), a))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.